WORST_CASE(?,O(n^1))

Solution:
---------

  "*" :: ["A"(7) x "A"(1)] -(13)-> "A"(4)
  "+" :: ["A"(0) x "A"(0)] -(0)-> "A"(12)
  "+Full" :: ["A"(7) x "A"(0)] -(7)-> "A"(0)
  "0" :: [] -(0)-> "A"(7)
  "0" :: [] -(0)-> "A"(1)
  "0" :: [] -(0)-> "A"(12)
  "Cons" :: ["A"(15) x "A"(15)] -(15)-> "A"(15)
  "Cons" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "Nil" :: [] -(0)-> "A"(15)
  "Nil" :: [] -(0)-> "A"(8)
  "S" :: ["A"(7)] -(7)-> "A"(7)
  "S" :: ["A"(1)] -(1)-> "A"(1)
  "S" :: ["A"(0)] -(0)-> "A"(0)
  "f" :: ["A"(14)] -(14)-> "A"(4)
  "goal" :: ["A"(15)] -(16)-> "A"(0)
  "map" :: ["A"(15)] -(4)-> "A"(0)


Cost Free Signatures:
---------------------

  "*" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "+" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "+Full" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "0" :: [] -(0)-> "A"_cf(0)
  "Cons" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "Nil" :: [] -(0)-> "A"_cf(0)
  "S" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "f" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "map" :: ["A"_cf(0)] -(0)-> "A"_cf(0)


Base Constructors:
------------------
  "\"+\"_A" :: ["A"(0) x "A"(0)] -(0)-> "A"(1)
  "\"0\"_A" :: [] -(0)-> "A"(1)
  "\"Cons\"_A" :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
  "\"Nil\"_A" :: [] -(0)-> "A"(1)
  "\"S\"_A" :: ["A"(1)] -(1)-> "A"(1)